Pretty good quantum fractional revival in paths and cycles
نویسندگان
چکیده
We initiate the study of pretty good quantum fractional revival in graphs, a generalization state transfer graphs. give complete characterization graph terms eigenvalues and eigenvectors adjacency matrix graph. This follows from lemma due to Kronecker on Diophantine approximation, is similar spectral Using this, we characterizations when can occur paths cycles.
منابع مشابه
Pretty Good Gravity
A theory of topological gravity is a homotopy-theoretic representation of the Segal-Tillmann topologification of a two-category with cobordisms as morphisms. This note describes a relatively accessible example of such a thing, suggested by the wall-crossing formulas of Donaldson theory. 1. Gravity categories A cobordism category has manifolds as objects, and cobordisms as morphisms. Such catego...
متن کاملPretty Good Democracy
Code voting seeks to address the issues of privacy and integrity for Remote Internet Voting. It sidesteps many of the inherent vulnerabilities of the Internet and client platforms but it does not provide end-to-end verification that votes are counted as cast. In this paper, we propose a simple technique to enhance the verifiability of code voting by ensuring that the Vote Server can only access...
متن کاملPretty Good Packet Authentication
Internet addresses are routinely being used to infer the identity of persons who send offending traffic – a capability they were not designed to provide. As a result, problems abound: innocent users are being accused, while the culprits can easily avoid detection. In this paper, we present Pretty Good Packet Authentication (PGPA), a simple service that can establish whether or not a given host ...
متن کاملPretty Good Voting
Recent academic assessments of the potential for secure Internet-based voting have been extremely pessimistic. A panel assembled to review the Department of Defense’s SERVE (Secure Electronic Registration and Voting Experiment) project– a system designed to allow foreign-based members of the armed services to vote online in Federal elections, which was nearly deployed for the 2004 election–conc...
متن کاملCharacterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2022
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.189